A formal derivation of Heaps' Law

نویسندگان

  • D. C. Van Leijenhorst
  • Theo P. van der Weide
چکیده

In this paper Heaps' Law is derived from the Mandelbrot distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Derivation of the Heap's Law from the Generalized Zipf's Law

I reproduce a rather simple formal derivation of the Heaps’ law from the generalized Zipf’s law, which I previously published in Russian [7].

متن کامل

Zipf's Law Leads to Heaps' Law: Analyzing Their Relation in Finite-Size Systems

BACKGROUND Zipf's law and Heaps' law are observed in disparate complex systems. Of particular interests, these two laws often appear together. Many theoretical models and analyses are performed to understand their co-occurrence in real systems, but it still lacks a clear picture about their relation. METHODOLOGY/PRINCIPAL FINDINGS We show that the Heaps' law can be considered as a derivative ...

متن کامل

Verifying Heaps' law using Google Books Ngram data

This article is devoted to the verification of the empirical Heaps law in European languages using Google Books Ngram corpus data. The connection between word distribution frequency and expected dependence of individual word number on text size is analysed in terms of a simple probability model of text generation. It is shown that the Heaps exponent varies significantly within characteristic ti...

متن کامل

Evolution of Scaling Emergence in Large-Scale Spatial Epidemic Spreading

BACKGROUND Zipf's law and Heaps' law are two representatives of the scaling concepts, which play a significant role in the study of complexity science. The coexistence of the Zipf's law and the Heaps' law motivates different understandings on the dependence between these two scalings, which has still hardly been clarified. METHODOLOGY/PRINCIPAL FINDINGS In this article, we observe an evolutio...

متن کامل

Pairing Heaps are Sub - optimalbyMichael

Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been veri ed that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Sci.

دوره 170  شماره 

صفحات  -

تاریخ انتشار 2005